On logical and concurrent equivalences

Equivalences for Concurrent and Distributed Systems

Logical characterization of probabilistic τ -bisimulation equivalences

Stochastic Petri nets (SPNs) is a well-known model for quantitative analysis. We consider the class called DTWSPNs that is a modification of discrete time SPNs (DTSPNs) by transition labeling and weights. Transitions of DTWSPNs are labeled by actions that represent elementary activities and can be visible or invisible for an external observer. For DTWSPNs, interleaving and step probabilistic τ ...

Concurrent Rewriting for Graphs with Equivalences

Several applications of graph rewriting systems (notably, some encodings of calculi with name passing) require rules which, besides deleting and generating graph items, are able to coalesce some parts of the graph. This latter feature forbids the development of a satisfactory concurrent semantics for rewrites (intended as a partial order description of the steps in a computation). This paper pr...

A Concurrent Logical Relation

We present a logical relation for showing the correctness of program transformations based on a new type-and-effect system for a concurrent extension of an ML-like language with higher-order functions, higher-order store and dynamic memory allocation. We show how to use our model to verify a number of interesting program transformations that rely on effect annotations. In particular, we prove a...

Linear logical relations and observational equivalences for session-based concurrency

We investigate strong normalization, confluence, and behavioral equality in the realmof session-based concurrency. These interrelated issues underpin advanced correctnessanalysis in models of structured communications. The starting point for our study isan interpretation of linear logic propositions as session types for communicating pro-cesses, proposed in prior work. Strong no...